Optimal estimation of low rank density matrices

نویسندگان

  • Vladimir Koltchinskii
  • Dong Xia
چکیده

The density matrices are positively semi-definite Hermitian matrices of unit trace that describe the state of a quantum system. The goal of the paper is to develop minimax lower bounds on error rates of estimation of low rank density matrices in trace regression models used in quantum state tomography (in particular, in the case of Pauli measurements) with explicit dependence of the bounds on the rank and other complexity parameters. Such bounds are established for several statistically relevant distances, including quantum versions of Kullback-Leibler divergence (relative entropy distance) and of Hellinger distance (so called Bures distance), and Schatten p-norm distances. Sharp upper bounds and oracle inequalities for least squares estimator with von Neumann entropy penalization are obtained showing that minimax lower bounds are attained (up to logarithmic factors) for these distances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Near-Optimal Estimation of Simultaneously Sparse and Low-Rank Matrices from Nested Linear Measurements

In this paper we consider the problem of estimating simultaneously low-rank and row-wise sparse matrices from nested linear measurements where the linear operator consists of the product of a linear operatorW and a matrix Ψ . Leveraging the nested structure of the measurement operator, we propose a computationally efficient two-stage algorithm for estimating the simultaneously structured target...

متن کامل

Von Neumann Entropy Penalization and Low Rank Matrix Estimation

We study a problem of estimation of a Hermitian nonnegatively definite matrix ρ of unit trace (for instance, a density matrix of a quantum system) based on n i.i.d. measurements (X1, Y1), . . . , (Xn, Yn), where Yj = tr(ρXj) + ξj , j = 1, . . . , n, {Xj} being random i.i.d. Hermitian matrices and {ξj} being i.i.d. random variables with E(ξj |Xj) = 0. The estimator ρ̂ := argminS∈S [ n−1 n ∑ j=1 (...

متن کامل

ROP: Matrix Recovery via Rank-One Projections

Estimation of low-rank matrices is of significant interest in a range of contemporary applications. In this paper, we introduce a rank-one projection model for low-rank matrix recovery and propose a constrained nuclear norm minimization method for stable recovery of low-rank matrices in the noisy case. The procedure is adaptive to the rank and robust against small low-rank perturbations. Both u...

متن کامل

Semiparametrically Efficient Rank - Based Inference for Shape Ii . Optimal R - Estimation of Shape

A class of R-estimators based on the concepts of multivariate signed ranks and the optimal rank-based tests developed in Hallin and Paindaveine [Ann. Statist. 34 (2006)] is proposed for the estimation of the shape matrix of an elliptical distribution. These R-estimators are root-n consistent under any radial density g, without any moment assumptions, and semiparametrically efficient at some pre...

متن کامل

The optimality of Dantzig estimator for estimating low rank density matrices

The famous Dantzig estimator(DE) has been applied in quantum state tomography for estimating an unknown low rank density matrix. The density matrices are positively semi-definite Hermitian matrices with unit trace that describe the states of quantum systems. The main contribution of this paper is deriving the low rank oracle inequality of DE and proving its convergence rates in the Schatten p-n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Machine Learning Research

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2015